Verify Account

SYLLABUS

UNIT-I

Introduction Algorithm Specification, Performance Analysis, Performance Measurement. Arrays: Arrays, Dynamically Allocated Arrays. Structures and Unions. Sorting: Motivation, Quick Sort, How Fast Can we Sort, Merge Sort, Heap Sort.

UNIT-II

Stack, Queue and Linked Lists Stacks, Stacks Using Dynamic Arrays, Queues, Circular Queues Using Dynamic Arrays, Evaluation of Expressions, Multiple Stacks and Queues. Linked Lists: Singly Linked Lists and Chains, Representing Chains in C, Linked Stacks and Queues, Additional List Operations, Doubly Linked Lists.

UNIT-III

Trees Introduction, Binary Trees, Binary Tree Traversals, Additional Binary Tree Operations, Binary Search Trees, Counting Binary Trees, Optimal Binary Search Trees, AVL Trees. B-trees, B+-trees.

UNIT-IV

Graphs and Hashing The Graph Abstract Data Type, Elementary Graph Operations, Minimum Cost Spanning Trees, Shortest Paths and Transitive Closure. Hashing: Introduction to Hash Table, Static Hashing, Dynamic Hashing. 

UNIT-V

Files and Advanced Sorting File Organization: Sequential File Organization, Direct File Organization, Indexed Sequential File Organization. Advanced Sorting: Sorting on Several Keys, List and Table Sorts, Summary of Internal Sorting, External Sorting.